Converting a büchi alternating automaton to a usual nondeterministic one
نویسندگان
چکیده
منابع مشابه
On Complementing Nondeterministic Büchi Automata
Several optimal algorithms have been proposed for the complementation of nondeterministic Büchi word automata. Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementation construction would be of significant practical value. Recently, Kupferman and Vardi described a com...
متن کاملThe Nondeterministic Complexity of a Finite Automaton
We deene the nondeterministic complexity of a nite automaton and show that there exist, for any integer p 1, automata which need (k 1=p) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable M-subsets of a free monoid into a hierarchy whose members are indexed by polynomials, where M denotes the Min{Plus semiring.
متن کاملLower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
The nonemptiness problem for nondeterministic automata on infinite words can be reduced to a sequence of reachability queries. The length of a shortest witness to the nonemptiness is then polynomial in the automaton. Nonemptiness algorithms for alternating automata translate them to nondeterministic automata. The exponential blow-up that the translation involves is justified by lower bounds for...
متن کاملSimulation relations for alternating Büchi automata
We adapt direct, delayed, and fair simulation to alternating Büchi automata. Unlike with nondeterministic Büchi automata, naive quotients do not preserve the recognized language. As a remedy, we present specifically designed definitions of quotients, namely minimax and semi-elective quotients: minimax quotients, which are simple and have a minimum number of transitions, preserve the recognized ...
متن کاملFrom Nondeterministic Suffix Automaton to Lazy Suffix Tree
Given two strings, a pattern P of length m and a text T of length n over some alphabet Σ of size σ, we consider the exact string matching problem, i.e. we want to report all occurrences of P in T . The well-known Backward-Nondeterministic-DAWG-Matching (BNDM) algorithm is one of the most efficient algorithm for short to moderate length patterns. In this paper – as a prelude – we take the underl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sadhana
سال: 1996
ISSN: 0256-2499,0973-7677
DOI: 10.1007/bf02745520